Innitary Lambda Calculus
نویسندگان
چکیده
In a previous paper we have established the theory of trans nite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of in nitary rewriting, the Bohm model of the lambda calculus can be seen as an in nitary term model. In contrast to term rewriting, there are several di erent possible notions of in nite term, which give rise to di erent Bohm-like models, which embody di erent notions of lazy or eager computation.
منابع مشابه
Applications of Innitary Lambda Calculus
We present an introduction to in nitary lambda calculus, highlighting its main properties. Subsequently we give three applications of in nitary lambda calculus. The rst addresses the non-de nability of Surjective Pairing, which in Barendregt [1984] is shown to be not de nable in lambda calculus. We show how this result follows easily as an application of Berry's Sequentiality Theorem, which its...
متن کاملOn the algebraic models of lambda calculus
The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way Boolean algebras algebraize the classical propositional calculus. The equational theory of lambda abstraction algebras is intended as an alternative to combinatory logic in this regard since it is a rst-order algebraic description of lambda calculus, which allow...
متن کاملOn the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملDecomposing Typed Lambda Calculus into a Couple of Categorical Programming Languages
We give two categorical programming languages with variable arrows and associated abstraction/reduction mechanisms, which extend the possibility of categorical programming Hag87, CF92] in practice. These languages are complementary to each other { one of them provides a rst-order programming style whereas the other does higher-order { and are \children" of the simply typed lambda calculus in th...
متن کاملDenotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995